Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
نویسندگان
چکیده
We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the security primitives, for instance Abelian group properties. We propose a general method for deriving decision algorithms, splitting the task into 4 properties of the rewriting system describing the intruder capabilities: locality, conservativity, finite variant property and decidability of one-step deducibility constraints. We illustrate this method on a non trivial example, combining several Abelian Group properties, exponentiation and a homomorphism, showing a decidability result for this combination.
منابع مشابه
Process algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملDynamic Tags for Security Protocols
The design and verification of cryptographic protocols is a notoriously difficulttask, even in symbolic models which take an abstract view of cryptography. This is mainlydue to the fact that protocols may interact with an arbitrary attacker which yields averification problem that has several sources of unboundedness (size of messages, numberof sessions, etc.).In this paper, ...
متن کاملar X iv : 0 70 8 . 35 64 v 1 [ cs . L O ] 2 7 A ug 2 00 7 Deciding security properties for cryptographic protocols . Application to key cycles ⋆
There has been a growing interest in applying formal methods for validating cryptographic protocols and many results have been obtained. In this paper, we re-investigate and extend the NP-complete decision procedure for a bounded number of sessions [33]. In this setting, constraint systems are now a standard for modeling security protocols. We provide a generic approach to decide general securi...
متن کاملTowards a Constrained-based Verification of Parameterized Cryptographic Protocols
Although many works have been dedicated to standard protocols like Needham-Schroeder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes standard protocol models by permitting unbounded lists inside messages. In this extended model we propose a correct and complete set of inference rules for checking security prope...
متن کاملTransforming Password Protocols to Compose
Formal, symbolic techniques are extremely useful for modelling and analysing security protocols. They improved our understanding of security protocols, allowed to discover aws, and also provide support for protocol design. However, such analyses usually consider that the protocol is executed in isolation or assume a bounded number of protocol sessions. Hence, no security guarantee is provided w...
متن کامل